The maximum f-depth spanning tree problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The maximum f-depth spanning tree problem

This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f(|V |) (called f − depthDSTPr). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of an approximate solution is placed in the interval between the worst and the best solutions values of...

متن کامل

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem

Given a vertex-weighted connected graphG = (V,E), the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree T of G such that the total weight of the internal vertices in T is maximized. The unweighted variant, denoted as MIST, is NPhard and APX-hard, and the currently best approximation algorithm has a proven performance ratio 13/17. The currently best approxi...

متن کامل

An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leaves k, this problem can be solved in time O(4poly(n)) using a simple branching algorithm introduced by a subset of the authors [12]. Daligault, Gutin, Kim, and Yeo [6] improved the branching and obtained a running time ...

متن کامل

Algorithms to solve the knapsack constrained maximum spanning tree problem

The knapsack problem and the minimum spanning tree problem are both fundamental in operations research and computer science. We are concerned with a combination of these two problems. That is, we are given a knapsack of a fixed capacity, as well as an undirected graph where each edge is associated with profit and weight. The problem is to fill the knapsack with a feasible spanning tree such tha...

متن کامل

Maximum Leaf Spanning Tree Problem for Grid Graphs

The complexity of the maximum leaf spanning tree problem for grid graphs is currently unknown. We determine the maximum number of leaves in a grid graph with up to 4 rows and with 6 rows. Furthermore, we give some constructions of spanning trees of grid graphs with a large number of leaves.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2001

ISSN: 0020-0190

DOI: 10.1016/s0020-0190(01)00160-0